- blue graph
- Математика: синий граф
Универсальный англо-русский словарь. Академик.ру. 2011.
blue graph
Смотреть что такое "blue graph" в других словарях:
Graph paper — Regular graphing paper (upper); Logarithmic graphing paper (lower). Graph paper, graphing paper, grid paper or millimeter paper is writing paper that is printed with fine lines making up a … Wikipedia
blue-jean — [ bludʒin ] n. m. • 1954; blue jeans 1941; mot angl. amér., de blue « bleu » et jean → jean ♦ Jean bleu. Un blue jean délavé. On trouve aussi un blue jeans [ bludʒin; bludʒins ]. Des blue jeans. « On voit des princes en salopette, des monarques à … Encyclopédie Universelle
Blue Earth County, Minnesota — Location in the state of Minnesota … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Graph factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … Wikipedia
Line graph — This article is about the mathematical concept. For statistical presentation method, see line chart. In graph theory, the line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Covering graph — In the mathematical discipline of graph theory, a graph C is a covering graph of another graph G if there is a covering map from the vertex set of C to the vertex set of G. A covering map f is a surjection and a local isomorphism: the… … Wikipedia
Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue … Wikipedia
Bipartite graph — In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets U and V such that every edge connects a vertex in U to one in V ; that is, U and V are independent sets.… … Wikipedia
Cayley graph — In mathematics, the Cayley graph, also known as the Cayley colour graph, is the graph that encodes the structure of a discrete group. Its definition is suggested by Cayley s theorem (named after Arthur Cayley) and uses a particular, usually… … Wikipedia
